Straight Line Matching Based on Graph Matching
نویسندگان
چکیده
منابع مشابه
ON THE MATCHING NUMBER OF AN UNCERTAIN GRAPH
Uncertain graphs are employed to describe graph models with indeterministicinformation that produced by human beings. This paper aims to study themaximum matching problem in uncertain graphs.The number of edges of a maximum matching in a graph is called matching numberof the graph. Due to the existence of uncertain edges, the matching number of an uncertain graph is essentially an uncertain var...
متن کاملConstraint-Based Graph Matching
Measuring graph similarity is a key issue in many applications. We propose a new constraint-based modeling language for defining graph similarity measures by means of constraints. It covers measures based on univalent matchings, such that each node is matched with at most one node, as well as multivalent matchings, such that a node may be matched with a set of nodes. This language is designed o...
متن کاملFully Compressed Pattern Matching Algorithm for Balanced Straight-Line Programs
We consider a fully compressed pattern matching problem, where both text T and pattern P are given by its succinct representation, in terms of straight-line programs and its variant. The length of the text T and pattern P may grow exponentially with respect to its description size n and m, respectively. The best known algorithm for the problem runs in O(nm) time using O(nm) space. In this paper...
متن کاملGraph Matching Based on Node Signatures
We present an algorithm for graph matching in a pattern recognition context. This algorithm deals with weighted graphs, based on new structural and topological node signatures. Using these signatures, we compute an optimum solution for node-to-node assignment with the Hungarian method and propose a distance formula to compute the distance between weighted graphs. The experiments demonstrate tha...
متن کاملWatermark Resynchronization based on Elastic Graph Matching
Most of the watermarking algorithms can still be defeated by geometric distortions today. If the weakness against global distortions can almost be considered as solved, local geometric distortions such as the ones introduced by StirMark remain a major issue. In this paper, an original resynchronization method is presented as a potential countermeasure against such attacks. The basic idea consis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Image and Signal Processing
سال: 2017
ISSN: 2325-6753,2325-6745
DOI: 10.12677/jisp.2017.61006